Binary block order Rouen Transform
نویسندگان
چکیده
Binary Block Order Rouen Transform Jacqueline W. Daykin1,2, Richard Groult3,4, Yannick Guesnet4, Thierry Lecroq4, Arnaud Lefebvre4, Martine Léonard4, Élise Prieur-Gaston4 1Department of Computer Science, Aberystwyth University (Mauritius Branch Campus), Quartier Militaire, Mauritius 2Department of Computer Science, Royal Holloway, University of London, UK 3Modélisation, Information et Systèmes (MIS), Université de Picardie Jules Verne, Amiens, France 4Normandie Univ., UNIROUEN, UNIHAVRE, INSA Rouen, LITIS, 76000 Rouen, France
منابع مشابه
Binary Image Watermarking with Tampering Localization in Binary Wavelet Transform Domain
We propose a watermarking scheme for the authentication of binary images. We transform the image using the binary wavelet transform and partition the resulting coefficients into treestructured blocks. The size of each block is decided by the number of flippable coefficients in the block. The flippable coefficients are found in the frequency domain by investigating high frequency coefficients. A...
متن کاملSecond-Order Statistical Texture Representation of Asphalt Pavement Distress Images Based on Local Binary Pattern in Spatial and Wavelet Domain
Assessment of pavement distresses is one of the important parts of pavement management systems to adopt the most effective road maintenance strategy. In the last decade, extensive studies have been done to develop automated systems for pavement distress processing based on machine vision techniques. One of the most important structural components of computer vision is the feature extraction met...
متن کاملFast Binary Block Matching Motion Estimation using Efficient One-Bit Transform
Binary block matching algorithm employs one-bit transform (1BT) to transform video sequences from full resolution representation (8-bit/pixel in general) to 1-bit/pixel bit-plane, then performs block matching motion estimation in bit-plane to save computations. Unfortunately, current 1BT algorithms either have bad output motion vectors or are computational intensive. In this paper, a novel fast...
متن کاملUncoded optimal binary communication for sources withmemory using the BurrowsWheeler Transform
Given an AWGN channel, we look at the problem of designing an optimal binary uncoded communication system for transmitting blocks of binary symbols generated by a stationary source with memory modelled by a Markov chain (MC) or a hidden Markov model (HMM). The goal is to minimize the average SNR required for a given block error rate. The particular case where the binary source is memoryless wit...
متن کاملExperimental Study of a Binary Block Sorting Compression Scheme
In this work, we provide an experimental evaluation of a block-sorting compression scheme that operates on bit level. We demonstrate that even such a simple technique, which ignores byte boundaries and uses a very simple modeling scheme for the output of the block-sorting transform, outperforms some of the best industry standard compressors for sources that are not byte-aligned, while providing...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Theor. Comput. Sci.
دوره 656 شماره
صفحات -
تاریخ انتشار 2016